An improved accelerated frame slotted aloha (afsa) algorithm for tag collision in rfid

The efficiency of tag identification in an RFID (radio identification system) can be low down due to the tag collision problems. The tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. As a result, the reader doesn’t identify the tag correctly. That causes a loss of information or data interference. To solve such kind of issues a series of ALOHA based algorithm and Binary search algorithm have been proposed. The most simple, popular and good giving performance algorithms are ALOHA based anti-collision algorithms. In this paper we present a new variation in Accelerated slotted Aloha (AFSA). Our proposed Algorithm by using the bitmaps and avoids wastages in bit times due to idleness and collided slots, reduce the tag reading time. The simulation result shows that AFSA can significantly reduce the average tag reading time with respect to the base protocols and achieve high tag reading rates under both static and mobile settings.